On Finite Subnormal Cayley Graphs
نویسندگان
چکیده
In this paper we introduce and study a type of Cayley graph – subnormal graph. We prove that 2-arc transitive is normal or cover complete bipartite $\mathbf{K}_{p^d,p^d}$ with $p$ prime. Then obtain generic method for constructing half-symmetric (namely edge but not arc transitive) graphs.
منابع مشابه
Percolation on Finite Cayley Graphs
In this paper, we study percolation on finite Cayley graphs. A conjecture of Benjamini says that the critical percolation pc of any vertex–transitive graph satisfying a certain diameter condition can be bounded away from one. We prove Benjamini’s conjecture for some special classes of Cayley graphs. We also establish a reduction theorem, which allows us to build Cayley graphs for large groups w...
متن کاملOn Isomorphisms of Finite Cayley Graphs
A Cayley graph Cay(G, S) of a group G is called a CI-graph if whenever T is another subset of G for which Cay(G, S) ∼= Cay(G, T ), there exists an automorphism σ of G such that Sσ = T . For a positive integer m, the group G is said to have the m-CI property if all Cayley graphs of G of valency m are CI-graphs; further, if G has the k-CI property for all k ≤ m, then G is called an m-CI-group, an...
متن کاملOn two-dimensional Cayley graphs
A subset W of the vertices of a graph G is a resolving set for G when for each pair of distinct vertices u,v in V (G) there exists w in W such that d(u,w)≠d(v,w). The cardinality of a minimum resolving set for G is the metric dimension of G. This concept has applications in many diverse areas including network discovery, robot navigation, image processing, combinatorial search and optimization....
متن کاملFinite Edge-transitive Cayley Graphs and Rotary Cayley Maps
This paper aims to develop a theory for studying Cayley graphs, especially for those with a high degree of symmetry. The theory consists of analysing several types of basic Cayley graphs (normal, bi-normal, and corefree), and analysing several operations of Cayley graphs (core quotient, normal quotient, and imprimitive quotient). It provides methods for constructing and characterising various c...
متن کاملOn the Finite Groups that all Their Semi-Cayley Graphs are Quasi-Abelian
In this paper, we prove that every semi-Cayley graph over a group G is quasi-abelian if and only if G is abelian.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Journal of Combinatorics
سال: 2021
ISSN: ['1077-8926', '1097-1440']
DOI: https://doi.org/10.37236/9934